Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation & material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological arrangements problem (TAP) in a finite queueing network is NP−Hard. Extensive computational results are included to test the properties of these network models to changes in service times, buffers, and otherMHS network parameters.